Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing

This paper proposes a new approach to the well known LiuLayland periodic scheduling problem. This approach proves that any justin-time sequence with maximum absolute deviation being less than one is in fact a periodic schedule. Consequently, periodic schedules can be obtained by any algorithm capable of generating just-in-time sequences with maximum absolute deviation being less than one, for instance, any algorithm minimizing maximum deviation or the quota methods of apportionment.